Generating a view for a schema including information on indication to transform recursive types to non-recursive structure in the schema

ABSTRACT

Provided are a computer program product, system, and method for generating a view for a schema. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. Indication is received to transform the recursive types to non-recursive structures. A view for the schema is generated including information on the indication to transform the recursive types to non-recursive structure, wherein the processing of the data defined by the view causes a parser to generate a structured element for each instance of the recursive element in schema data being parsed, wherein the generated structured element includes a unique identifier of the instance of the recursive element.

BACKGROUND OF THE INVENTION 1. Field of the Invention

The present invention relates to a computer program product, system, andmethod for generating a view for a schema including information onindication to transform recursive types to non-recursive structure inthe schema.

2. Description of the Related Art

An Extensible Markup Language (XML) schema is a description of elementsin a document encoded using the XML language. The XML schema may also beused to define a data model, also known as a meta model comprising adefinition of a hierarchical representation of nodes that represent thedata and relationship of data content for a data model. XML schemas thatdefine more complex data models may have 1000s of nodes arranged in acomplex hierarchy of trees of nodes. A large scale schema may becomprised of multiple XML Schema Definition (XSD) files and provides adefinition of large scale trees of nodes and data content.

An XML schema may include a recursive data type. An XML schema is saidto be recursive when the type definition allows for elements of the samename and type to appear in their own definition. Recursion may beexplicit or implicit such that recursive elements defined with therecursive data type will themselves contain other instances of that sametype. The presence of recursive types significantly increases thecomplexity of specifying transformations between XML datasets as well asbetween XML datasets and datasets with non-hierarchical formats such asrelational. The XML schemas which define the structure of XML datarepresent the recursive data structures via recursive type definitions.Transformations to, from, and between XML datasets are typicallyspecified as mappings to and from the types defined in the XML schemas.Such mappings serve to document the relationships between datasets andalso provide the basis for automated transformation tools that convertone dataset into another. But in the presence of recursive types, simplemappings are inherently ambiguous since it can be unclear which, and howmany, levels of recursive structure are being mapped.

SUMMARY

Provided are a computer program product, system, and method forgenerating a view for a schema including information on indication totransform recursive types to non-recursive structure in the schema. Aschema provides a definition of elements, wherein at least one of theelements comprises a recursive element of a recursive data type, whereinthe recursive data type allows for instances of the recursive element toinclude instances of that same recursive data type at different levelsin a hierarchy. Indication is received to transform the recursive typesto non-recursive structures. A view for the schema is generatedincluding information on the indication to transform the recursive typesto non-recursive structure, wherein the processing of the data definedby the view causes a parser to generate a structured element for eachinstance of the recursive element in schema data being parsed, whereinthe generated structured element includes a unique identifier of theinstance of the recursive element.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an embodiment of a computing environment.

FIG. 2 illustrates an example of a snippet of schema defining elements.

FIG. 3 illustrates an example of a snippet of generated structured XMLelements.

FIGS. 4 and 12 illustrate embodiments of operations to generate a viewfor a schema.

FIG. 5 illustrates an embodiment of operations to generate a graphicaluser interface (GUI) to create a view.

FIGS. 6 and 7 illustrate embodiments of a GUI to define elements toinclude in a view.

FIG. 8 illustrates an embodiment of view node information.

FIG. 9 illustrates an embodiment of operations to parse data for aschema using a view.

FIG. 10 illustrates an embodiment of a GUI to define terminationconditions for a recursive element.

FIG. 11 illustrates an embodiment of operations to parse data for aschema.

FIG. 13 illustrates an embodiment of a schema definition to transformrecursive structures to non-recursive structures.

FIG. 14 illustrates an embodiment of operations to parse schema data anda view for the schema when the schema definition includes anon-recursive type definition for the previously defined recursiveelements.

FIG. 15 illustrates an embodiment of output from parsing the schemaaccording to FIG. 14.

FIG. 16 illustrates an embodiment of computing components.

DETAILED DESCRIPTION

Described embodiments provide techniques to generate a view for a schemato limit a number of levels at which recursive elements are expanded ina view by allowing the view to have instances of recursive elementschunked upon satisfying a condition for terminating recursion to allowthe user to control the level at which instances of structured recursiveelements are generated into the view output. Further embodiments providetechniques for transforming hierarchical recursive type elements tonon-recursive type elements where hierarchical information is encoded inattributes of the non-recursive type elements.

FIG. 1 illustrates an embodiment of a computing environment 100including a computer with a client web graphical user interface (GUI)102, an application server 104, a repository 106, and a file system 108.Users access the client GUI 102 to import XSD files 110 from file system108 and save the XML, schema 112 defined by the XSD files 110 to therepository 106. The client GUI 102 invokes the schema import service 114deployed on the application server 104 to import XSD files 110. A userat the client GUI 102 further invokes the view creation and edit service116 to create views 118 of an XML schema 112 and save the views 118 tothe central repository 106. The client GUI 102 invokes the view creationand edit service 116 deployed on the application server 104 to createand edit views 118.

The user accesses the GUI 102 to invoke an XML parser 120 to parse XMLdata 122, comprising an implementation of the XML schema 112, accordingto the view 118 to generate XML view output 124 comprising a definedview of the XML elements from the XM data 122.

The application server 104, client GUI 102, repository 106, and filesystem 108 may interconnect over a network 126. The components of FIG. 1may be implemented with suitable computing architectures. In oneembodiment, the client GUI 102 may be web based, invoking the services114, 116, and 120 using SOAP (Simple Object Access Protocol) webservices or Hypertext Transport Protocol (HTTP) based RepresentationalState Transfer (REST) services. In one embodiment, the client GUI 102and the services 114, 116, and 120 may be integrated into one standaloneapplication or distributed in multiple application components. Therepository 106 may comprise a relational database or a non-relationaldatabase.

The repository 106 and file system 108 may be implemented in storagemedia in one or more storage devices known in the art, such asinterconnected hard disk drives (e.g., configured as a DASD, RAID, JBOD,etc.), solid state storage devices (e.g., EEPROM (Electrically ErasableProgrammable Read-Only Memory), flash memory, solid state disks (SSDs),flash disk, storage-class memory (SCM)), electronic memory, etc. Therepository 106 and file system 108 may be implemented in the same ordifferent storage devices. The network 126 may comprise aninterconnected network (e.g., Intranet, Internet, Local Area Network(LAN), Storage Area Network (SAN), etc.).

In described embodiments, the schema 112 comprises an XML schema. Inalternative embodiments, the schema 112 may be implemented in suitablestructured document definition languages other than XML. Further, theXML schema may comprise a text-based meta-language for describing datashared between applications as defined for an industry group.

The views 118, created by the view creation and edit service 116, andstored in the repository 106, include a schema identifying the schema112 from which the view 118 was generated and nodes corresponding tonodes or elements selected from the schema 112. Each view node in a view122 has a matching node in the schema 112. The view nodes includeinformation on how to render the nodes from the schema, corresponding toelements in the schema, in the view output 124, i.e., whether toinclude, chunk or generate structured elements for the instances of theelements corresponding to the view nodes.

FIG. 2 illustrates an embodiment of a snippet of a schema definition 200having a recursive definition for the recursive element “manages” 206,which has an XML type of

EmployeeType 204. The recursive element “manages” 206 defines arelationship that an employee can manage multiple other employees whichcan have their own recursive element “manages”.

FIG. 3 illustrates XML data 122 having data for the schema definition200 of FIG. 2, showing an instance of an employee element 302 and thenrecursive instances of the “manages” element 304 of employees thatmanage other employees, and so on. Described embodiments concernoperations to transform the XML data 122, such as the data 300, into arelational data set or other formats to be stored in a relational orother types of databases.

FIG. 4 illustrates an embodiment of operations performed by the viewcreation and edit service 116 to generate a view 118 to terminaterecursion of structured recursive elements at a certain level. Uponinitiating (at block 400) an operation to generate a view 118, a schema112 is imported (at block 402). The view creation and edit service 116receives (at block 404) a condition for terminating recursion for arecursive element in the imported XML data 122. A view 118 for theschema including information on the condition for terminating therecursion is generated (at block 406) and the generated view 118 isstored (at block 408) in the repository 106.

FIG. 5 illustrates an embodiment of operations performed by the viewcreation and edit service 116 to provide a graphical user interface(GUI) to enable a user to select through the GUI the condition forterminating recursion. Upon initiating (at block 500) an operation togenerate a GUI for the view creation and edit server 116, such as theGUI 600 shown in FIG. 6 and GUI 700 shown in FIG. 7, the view creationand edit service 116 generates (at block 502) a GUI having a treerepresentation of nodes for the elements in the XML schema 112,including a user selectable node for each level of the recursive elementin the XML schema 112. Each user selectable node enables a user toexpand the recursive element at the level associated with the node tohave instances of that recursive level at that level included asstructured elements in the view output 124 or whether chunking willoccur for the recursive elements and all instances having a level belowthe level of the recursive element selected from the GUI.

For instance, the GUI 600 in FIG. 6 shows a tree representation 602 ofthe employee elements and “manages” recursive elements in the XML schema112. FIG. 6 shows user selectable nodes for the employee and managesrecursive element that allows the user to selectively unwind thatelement by clicking the plus sign (“+”) adjacent to the manages element,once the plus sign is selected, the negative sign (“−”) is displayed asshown in FIG. 6 showing that that element has been unwound at thatlevel. When the user selects to “unwind” the “manages” recursiveelement, all the attributes for that element are shown. By selecting tounwind a node representing a recursive element, the user has selected toinclude that level of the recursive element as a structured elementgenerated into any view output 124. The user has indicated in the GUI600 to include five levels of instances of the recursive element becausefive levels of the manages recursive element are shown as “unwound”. Theuser has also selected to chunk below the fifth level by not unwindingthe text attribute 604 below the fifth instance of the “manages”recursive element 606 to allow expansion beyond the fifth level of themanages recursive element. In this way, the user has selected to chunkbelow the fifth level of instances of the recursive element. Chunking ata level and all levels beyond that chunked level causes the parser 120to output the recursive elements as text in a string, and not asstructured elements in the schema language, e.g., XML.

FIG. 7 illustrates another embodiment of the GUI 700 having nodes, e.g.,702 ₁, 702 ₂, 703 ₃, 704 ₄, for each level of the manages recursiveelement in the XML schema 112. The user may select to include instancesthat level of the recursive element in the view 116 by toggling thearrow graphical element to the left of each of the nodes 702 ₁, 702 ₂,703 ₃, 704 ₄. A downward pointing arrow graphical element, such as forthe nodes 702 ₁, 702 ₂, 703 ₃, indicates that those levels have beenexpanded to include in the view, by not toggling the arrow for therecursive element 704 ₄, the user has selected to chunk below thatfourth level. The user may also indicate to not include a level of arecursive element in the view by selecting the check boxes in theinclude column 706. If the include box is checked, than instances forthat level of the manages recursive element is included in the viewoutput 124, otherwise if unchecked, instances of that level of recursiveelement are not included in the view output 124. If the level of theinstance of the recursive element is included in the view output 124,then the user may select the box in the chunk column 708 to indicatethat instances of the recursive element at the corresponding level ofthe selected chunk box 710, e.g., the manages element 702 ₄ at thefourth level and levels beyond the fourth level are to be chunked.

The user may use command lines to provide instructions for a level ofthe recursive element at which instances of the recursive element in theXML, schema 112 will be chunked. For instance, the user may specify amaximum level up to which instances of the specified recursive elementwill be generated into the view output 124, such that instances forlevels of the recursive element beyond the user specified maximum levelare chunked, meaning their data is included in a string as text, not asnested XML structured elements.

FIG. 8 illustrates an embodiment of view node information 800 includedin the view 122 being generated based on the level at which the userselected to chunk a particular recursive element, which may be specifiedthrough a GUI, such as shown in FIGS. 6 and 7. The view node information800 for one node includes a view node name 802, such as for a recursiveelement; a level 804 in the recursive nodes; an include field 806indicating whether instances of the recursive element corresponding tothe view nod 802 are included in the view 118; and a chunk field 808indicating whether instances of corresponding recursive element at thecorresponding level 804 are chunked. If not indicated as chunked, theninstances of the recursive element corresponding to the view node 802are generated as structured XML elements into the view output 124.

FIG. 9 illustrates an embodiment of operations performed by the XMLparser 120 to parse the XML data 122, i.e., schema 112 data, accordingto one of the views 118 having a termination condition for a recursiveelement to generate view output 124 during parsing runtime. Uponinitiating (at block 900) an operation to parse the XML data 122according to a view 118, the XML parser 120 may process (at block 902)non-recursive elements and attributes and generate them as structuredelements, e.g., structured XML data, into the view output 124. Uponprocessing (at block 904) an instance of a recursive element in the XMLdata 122, e.g., manages, if (at block 906) a termination conditionindicates to not terminate recursion at the level of the processedinstance, i.e., chunking was not selected for that level, then the XMLparser 120 generates (at block 908) a structured element for theinstance into the view output 124. Otherwise, if the level of theprocessed instance of the recursive element is to be chunked, then theXML parser 120 chunks (at block 910) data for the processed instance andfor instances of recursive elements at higher levels of recursion withinthe instance processed into a string as text. The string data of chunkedinstances of recursive elements may be logged, included into the viewoutput 122, discarded, etc. From block 908 or 910, if (at block 912)there are further unprocessed instances of the recursive element in theXML data 122, then control proceeds back to block 904 to process thatfurther instance, else, control ends.

In this way, the XML parser 120 will recognize non-nested (top level)instances of the recursive type, parse the contents of those instances,and emit the XML structure corresponding to those instances. Nestedinstances of the recursive type will also be parsed and emitted as XMLstructure as long as the user specified recursion level has not beenreached. Once the maximum prescribed recursion level has been reached,the parser 120 chunks the nested instances at and below that level, anddoes not parse the nested instance's components. Instead, the parser 120emits a string representation of the nested instance (including anyadditional instances nested within the current one) rather than emittingan XML structure.

In a further embodiment to specify the termination condition, the usermay supply via a GUI or command line interface a predicate for eachrecursive type and that predicate specifies the condition under whichinstances of the recursive element are chunked or not outputted asstructured element instances, XML structures. In one embodiment thepredicate may be coded as an annotation in the view schema, e.g.,“<xsd:annotation><xsd:appinfo>predicate</xsd:appinfo></xsd:annotation>”.These termination condition annotations may be attached to the typedefinitions in the view 118 schema definitions so that the predicatescan be evaluated at runtime.

When the XML parser 120 recognizes an instance of the recursive type,the parser evaluates the predicate. If the predicate evaluates to truethen the parser emits the XML structure corresponding to the instanceand continues parsing the instance's components. If the predicateevaluates to false then the parser chunks the instance; it does notparse the instance's components, and the parser emits a stringrepresentation of the instance rather than emitting an XML structure.

FIG. 10 illustrates an embodiment of a GUI 1000 in which the user hasentered an expression 1002 specifying termination conditions for the“manages” recursive element where the user has created a predicateexpression that specifies different levels of the recursive element atwhich to terminate recursion for different values of an attribute of therecursive element. For instance, if the employee title attribute for anemployee managing another employee is “executive”, then recursion isterminated at level four, allowing four recursive levels instances ofthe recursive element “manages” for executive employees to be generatedas structured XML elements, e.g., with tags and markup, into the viewoutput 124. After the fourth level, the instances of the managerrecursive element are chunked. The expression 1002 also specifies thatif the manager employee is a “second line manager” than there are threelevels of instances of the recursive element “manages” generated asstructured XML elements. Otherwise, if the type of the employee is notspecified, only one level of instances of that type of “manages” aregenerated as structured elements in the view output 122.

FIG. 11 illustrates an embodiment of operations performed by the XMLparser 120 to parse XML data 122 for a view 118 that includes atermination condition comprising a predicate providing specifyingtermination at different levels of recursion for different attributes ofthe recursive element, such as shown in the expression 1002 in FIG. 10.Upon initiating (at block 1100) an operation to parse XML, data 122using a view 118 having a predicate indicating different levels of therecursive element at which to terminate recursion for different valuesof an attribute of the recursive element, the XML parser 120 may process(at block 1102) non-recursive elements and attributes and generate themas structured elements, e.g., structured XML data, into the view output124. Upon processing (at block 1104) an instance of a recursive elementin the XML data 122, e.g., manages, if (at block 1106) the attributevalue for the processed instance indicates that the level of theprocessed instance is not the level at which to terminate recursion,then the XML parser 12 generates (at block 1108) a structured elementfor the instance in the view output 124. Otherwise, if (at block 1106)the attribute value for the processed instance indicates that recursionshould be terminated for the level of the processed instance, then theXML parser 120 chunks (at block 1110) data for the processed instanceand for instances of recursive elements at higher levels of recursionwithin the instance processed into a string as text. From block 1108 or1110, if (at block 1112) there are further unprocessed instances of therecursive element in the XML data 122, then control proceeds back toblock 1104 to process that further instance, else, control ends.

In a further embodiment, the XML parser 120 may be configured totransform hierarchically structured data, such as recursive elements, toa flat, relational dataset where the XML output may be readilytransformed to relational data for a relational database.

FIG. 12 illustrates an embodiment of operations performed by the viewcreation and edit service 116 to augment the XML element definitions inthe view 118 schema to allow for the transformation of recursivehierarchical elements to flat, non-hierarchical data, when parsing theXML data 112. Upon initiating (at block 1200) an operation to generate aview 118, the schema 112 is imported (at block 1202). The view creationand edit service 116 receives (at block 1204) user input parse recursivetypes as non-recursive structures for the recursive element defined inthe schema. The view creation and edit service 116 augments (at block1206) the definition of the recursive element in the view 118 schema toinclude a first attribute for the unique identifier of the element and asecond attribute for the parent unique identifier. The generated view118 is then stored (at block 1208)

FIG. 13 illustrates an example of how the schema 112 having thedefinition of the manages recursive EmployeeType definition shown inFIG. 2 may be augmented in the definition 1300 in the view 118 toinclude as attributes a unique ID 1302 and parent ID 1304 having theunique ID of the parent to the recursive element. Further, thedefinition 1300 does not include a recursive definition such as shown inFIG. 2 for the EmployeeType having an unbounded 208 number ofoccurrences. In this way, the element definition of the recursiveelement in the view 118 schema is flattened, and hierarchicalinformation is encoded in the parent ID 1302 attribute indicating ahierarchical parent to an EmployeeType instance.

FIG. 14 illustrates an embodiment of operations performed by the XMLparser 120 to process XML data 122 and a view including the augmentedschema definition, such as shown in FIG. 13. Upon initiating (at block1400) an operation to parse based on a view 118 having a schemadefinition including the non-recursive type definition with XML datahaving instances of the recursive element, the XML parser 120 sets (atblock 1402) a variable i to 1, which is used to determine the unique ID1302 for the recursive element. Upon processing (at block 1404) aninstance of the recursive element in the XML data 122, the XML parser120 generates (at block 1406) a structured element XML statement for theelement having an ID attribute 1302 set to i. If (at block 1408) theprocessed instance is not a child to a parent instance of the recursiveelement, i.e., at a lower level in the hierarchy of the recursiveelement instances, then the attribute for the parent ID 1304 is set (atblock 1410) to indicate no parent. Otherwise, if there is a parentinstance of the processed instance of the recursive element, then theparent ID attribute 1304 is set (at block 1412) to the ID attributevalue 1302 of the parent instance, for which a structured elementstatement would have been generated. If (at block 1414) there arefurther instances of the recursive element to process, control proceedsback to block 1404, else control ends.

With the operations of FIG. 14, the presence of the ID 1302 and parentID1304 attribute values effectively encodes the hierarchical relationshipswithin the data, without requiring those relationships to be explicitlyreflected in the XML structures.

FIG. 15 illustrates an example of the non-hierarchical view output 124,where the element definition statements are non-hierarchical, withhierarchical relationship information reflected in the ID and parent IDattribute values.

The described embodiments provide techniques to terminate the number oflevels at which instances of recursive elements are generated into viewoutput to allow the user to tailor the schema view output for easierviewing. Further, with described embodiments, the user may create a viewwith a modified schema definition for recursive elements that transformsan element having a recursive type into a non-recursive type elementwith hierarchical information encoded in attributes of the structuredelement generated into the view output.

The described embodiments allow the user to tailor the display andrendering of instances of recursive elements in view output to optimizethe viewing options for the user.

The described operations may be implemented as a method, apparatus orcomputer program product using standard programming and/or engineeringtechniques to produce software, firmware, hardware, or any combinationthereof. Accordingly, aspects of the embodiments may take the form of anentirely hardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.” Furthermore,aspects of the embodiments may take the form of a computer programproduct embodied in one or more computer readable medium(s) havingcomputer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described above with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The terms “an embodiment”, “embodiment”, “embodiments”, “theembodiment”, “the embodiments”, “one or more embodiments”, “someembodiments”, and “one embodiment” mean “one or more (but not all)embodiments of the present invention(s)” unless expressly specifiedotherwise.

The terms “including”, “comprising”, “having” and variations thereofmean “including but not limited to”, unless expressly specifiedotherwise.

The enumerated listing of items does not imply that any or all of theitems are mutually exclusive, unless expressly specified otherwise.

The terms “a”, “an” and “the” mean “one or more”, unless expresslyspecified otherwise.

Devices that are in communication with each other need not be incontinuous communication with each other, unless expressly specifiedotherwise. In addition, devices that are in communication with eachother may communicate directly or indirectly through one or moreintermediaries.

A description of an embodiment with several components in communicationwith each other does not imply that all such components are required. Onthe contrary a variety of optional components are described toillustrate the wide variety of possible embodiments of the presentinvention.

Further, although process steps, method steps, algorithms or the likemay be described in a sequential order, such processes, methods andalgorithms may be configured to work in alternate orders. In otherwords, any sequence or order of steps that may be described does notnecessarily indicate a requirement that the steps be performed in thatorder. The steps of processes described herein may be performed in anyorder practical. Further, some steps may be performed simultaneously.

When a single device or article is described herein, it will be readilyapparent that more than one device/article (whether or not theycooperate) may be used in place of a single device/article. Similarly,where more than one device or article is described herein (whether ornot they cooperate), it will be readily apparent that a singledevice/article may be used in place of the more than one device orarticle or a different number of devices/articles may be used instead ofthe shown number of devices or programs. The functionality and/or thefeatures of a device may be alternatively embodied by one or more otherdevices which are not explicitly described as having suchfunctionality/features. Thus, other embodiments of the present inventionneed not include the device itself.

The illustrated operations of the figures show certain events occurringin a certain order. In alternative embodiments, certain operations maybe performed in a different order, modified or removed. Moreover, stepsmay be added to the above described logic and still conform to thedescribed embodiments. Further, operations described herein may occursequentially or certain operations may be processed in parallel. Yetfurther, operations may be performed by a single processing unit or bydistributed processing units.

The elements of the computing environment of FIG. 1, including theclient GUI 102, application server 104 and components 114, 116, 120,repository 106, and file system 108 may be implemented in one or morecomputer systems, such as the computer system 1602 shown in FIG. 16.Computer system/server 1602 may be described in the general context ofcomputer system executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 1602 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

As shown in FIG. 16, the computer system/server 1602 is shown in theform of a general-purpose computing device. The components of computersystem/server 1602 may include, but are not limited to, one or moreprocessors or processing units 1604, a system memory 1606, and a bus1608 that couples various system components including system memory 1606to processor 1604. Bus 1608 represents one or more of any of severaltypes of bus structures, including a memory bus or memory controller, aperipheral bus, an accelerated graphics port, and a processor or localbus using any of a variety of bus architectures. By way of example, andnot limitation, such architectures include Industry StandardArchitecture (ISA) bus, Micro Channel Architecture (MCA) bus, EnhancedISA (EISA) bus, Video Electronics Standards Association (VESA) localbus, and Peripheral Component Interconnects (PCI) bus.

Computer system/server 1602 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 1602, and it includes both volatileand non-volatile media, removable and non-removable media.

System memory 1606 can include computer system readable media in theform of volatile memory, such as random access memory (RAM) 1610 and/orcache memory 1612. Computer system/server 1602 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 1613 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 1608 by one or more datamedia interfaces. As will be further depicted and described below,memory 1606 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 1614, having a set (at least one) of program modules1616, may be stored in memory 1606 by way of example, and notlimitation, as well as an operating system, one or more applicationprograms, other program modules, and program data. Each of the operatingsystem, one or more application programs, other program modules, andprogram data or some combination thereof, may include an implementationof a networking environment. The components of the computer 2 may beimplemented as program modules 1616 which generally carry out thefunctions and/or methodologies of embodiments of the invention asdescribed herein. The components 18, 24, 28, 48, and 50 of the computingenvironment 1 may be implemented in one or more computer systems 1602,where if they are implemented in multiple computer systems 1602, thenthe computer systems may communicate over a network.

Computer system/server 1602 may also communicate with one or moreexternal devices 1618 such as a keyboard, a pointing device, a display1620, etc.; one or more devices that enable a user to interact withcomputer system/server 12; and/or any devices (e.g., network card,modem, etc.) that enable computer system/server 1602 to communicate withone or more other computing devices. Such communication can occur viaInput/Output (I/O) interfaces 1622. Still yet, computer system/server1602 can communicate with one or more networks such as a local areanetwork (LAN), a general wide area network (WAN), and/or a publicnetwork (e.g., the Internet) via network adapter 1624. As depicted,network adapter 1624 communicates with the other components of computersystem/server 1602 via bus 1608. It should be understood that althoughnot shown, other hardware and/or software components could be used inconjunction with computer system/server 1602. Examples, include, but arenot limited to: microcode, device drivers, redundant processing units,external disk drive arrays, RAID systems, tape drives, and data archivalstorage systems, etc.

The foregoing description of various embodiments of the invention hasbeen presented for the purposes of illustration and description. It isnot intended to be exhaustive or to limit the invention to the preciseform disclosed. Many modifications and variations are possible in lightof the above teaching. It is intended that the scope of the invention belimited not by this detailed description, but rather by the claimsappended hereto. The above specification, examples and data provide acomplete description of the manufacture and use of the composition ofthe invention. Since many embodiments of the invention can be madewithout departing from the spirit and scope of the invention, theinvention resides in the claims herein after appended.

1-21. (canceled)
 22. A computer program product for processing schemasand data in a storage system, wherein the computer program productcomprises a computer readable storage medium having computer readableprogram code embodied therein that executes to perform operations, theoperations comprising: providing a schema, wherein the schema provides adefinition of elements, wherein at least one of the elements comprises arecursive element of a recursive data type, wherein the recursive datatype allows for instances of the recursive element to include instancesof that same recursive data type at different levels in a hierarchy;generating a view for the schema including information on the indicationto transform the recursive data types to non-recursive structure;determining for a processed instance of a recursive element in the viewwhether the indication to transform the recursive data types tonon-recursive structure indicates to terminate recursion; generating astructured element for each instance of the recursive element in schemadata that does not indicate to terminate recursion that includes aunique identifier of the instance of the recursive element; and chunkingdata for the processed instance of the recursive element and forinstances of recursive elements at higher levels of recursion within theprocessed instance in response to the indication to terminate recursion.23. The computer program product of claim 22 wherein the operationsfurther comprise: receiving indication to transform recursive data typesto non-recursive structures, wherein a parser determines from theindication to transform the recursive data types to non-recursivestructure for the processed instance whether to terminate recursion forthe processed instance of the recursive element, wherein the parserfurther performs the generating the structured element and the chunkingdata.
 24. The computer program product of claim 22, wherein thestructured element further includes a parent unique identifier of aparent instance of the instance for which the structured element isgenerated.
 25. The computer program product of claim 24, wherein thestructured elements comprise a non-recursive type definition, andwherein information on the levels of the hierarchy are encoded in theunique identifier and the parent unique identifier of the structuredelements generated for the instances of the recursive elements.
 26. Thecomputer program product of claim 24, wherein the structured elementincludes an attribute parent identifier, wherein the attribute parentidentifier is set to indicate no parent if the structured element is nota child in the hierarchy, and wherein the attribute parent identifier isset to attribute ID of the structured element for the parent instance ofthe structured element being generated.
 27. The computer program productof claim 22, wherein unique identifiers of instances of the recursiveelements comprise a sequential number indicating an order in which theinstance of the recursive elements was processed when processing theinstances of the recursive element.
 28. The computer program product ofclaim 22, wherein the structured element further includes a parentunique identifier of a parent instance of the instance for which thestructured element is generated, wherein the unique identifiers of theinstances comprises a sequential number indicating an order in which theinstance of the recursive elements was processed when processing theinstances of the recursive element, and wherein the parent uniqueidentifier comprises the sequential number assigned to the instance ofthe recursive element comprising the parent instance.
 29. The computerprogram product of claim 22, wherein the structured elements comprise anon-recursive type definition.
 30. A system for processing schemas anddata in a storage system, comprising: a processor; and a computerreadable storage medium including program code executed by the processorto perform operations, the operations comprising: providing a schema,wherein the schema provides a definition of elements, wherein at leastone of the elements comprises a recursive element of a recursive datatype, wherein the recursive data type allows for instances of therecursive element to include instances of that same recursive data typeat different levels in a hierarchy; generating a view for the schemaincluding information on the received indication to transform therecursive data types to non-recursive structure; determining for aprocessed instance of a recursive element in the view whether theindication to transform the recursive data types to non-recursivestructure indicates to terminate recursion; generating a structuredelement for each instance of the recursive element in schema data thatdoes not indicate to terminate recursion that includes a uniqueidentifier of the instance of the recursive element; and chunking datafor the processed instance of the recursive element and for instances ofrecursive elements at higher levels of recursion within the processedinstance in response to the indication to terminate recursion.
 31. Thesystem of claim 30 wherein the operations further comprise: receivingindication to transform recursive data types to non-recursivestructures, wherein a parser determines from the indication to transformthe recursive data types to non-recursive structure for the processedinstance whether to terminate recursion for the processed instance ofthe recursive element, wherein the parser further performs thegenerating the structured element and the chunking data.
 32. The systemof claim 30, wherein the generated structured element further includes aparent unique identifier of a parent instance of the instance for whichthe structured element is generated.
 33. The system of claim 32, whereinthe structured elements comprise a non-recursive type definition, andwherein information on the levels of the hierarchy are encoded in theunique identifier and the parent unique identifier of the structuredelements generated for the instances of the recursive elements.
 34. Thesystem of claim 32, wherein the generated structured element includes anattribute parent identifier, wherein the attribute parent identifier isset to indicate no parent if the structured element is not a child inthe hierarchy, and wherein the attribute parent identifier is set toattribute ID of the structured element for the parent instance of thestructured element being generated.
 35. The system of claim 30, whereinunique identifiers of instances of the recursive elements comprise asequential number indicating an order in which the instance of therecursive elements was processed when processing the instances of therecursive element.
 36. A method for processing schemas and data in astorage system, comprising: providing a schema, wherein the schemaprovides a definition of elements, wherein at least one of the elementscomprises a recursive element of a recursive data type, wherein therecursive data type allows for instances of the recursive element toinclude instances of that same recursive data type at different levelsin a hierarchy; generating a view for the schema including informationon the received indication to transform the recursive data types tonon-recursive structure; determining for a processed instance of arecursive element in the view whether the indication to transform therecursive data types to non-recursive structure indicates to terminaterecursion; generating a structured element for each instance of therecursive element in schema data that does not indicate to terminaterecursion that includes a unique identifier of the instance of therecursive element; and chunking data for the processed instance of therecursive element and for instances of recursive elements at higherlevels of recursion within the processed instance in response to theindication to terminate recursion.
 37. The method of claim 36 furthercomprising: receiving indication to transform recursive data types tonon-recursive structures, wherein a parser determines from theindication to transform the recursive data types to non-recursivestructure for the processed instance whether to terminate recursion forthe processed instance of the recursive element, wherein the parserfurther performs the generating the structured element and the chunkingdata.
 38. The method of claim 36, wherein the structured element furtherincludes a parent unique identifier of a parent instance of the instancefor which the structured element is generated.
 39. The method of claim38, wherein the generated structured elements comprise a non-recursivetype definition, and wherein information on the levels of the hierarchyare encoded in the unique identifier and the parent unique identifier ofthe structured elements generated for the instances of the recursiveelements.
 40. The method of claim 38, wherein the generated structuredelement includes an attribute parent identifier, wherein the attributeparent identifier is set to indicate no parent if the structured elementis not a child in the hierarchy, and wherein the attribute parentidentifier is set to attribute ID of the structured element for theparent instance of the structured element being generated.
 41. Themethod of claim 36, wherein unique identifiers of instances of therecursive elements comprise a sequential number indicating an order inwhich the instance of the recursive elements was processed whenprocessing the instances of the recursive element.